The number of algebraic cycles with bounded degree
نویسندگان
چکیده
منابع مشابه
The Number of Algebraic Cycles with Bounded Degree
Let X be a projective scheme over a finite field. In this paper, we consider the asymptotic behavior of the number of effective cycles on X with bounded degree as it goes to the infinity. By this estimate, we can define a certain kind of zeta functions associated with groups of cycles. We also consider an analogue in Arakelov geometry. Introduction Let X be a projective scheme over a finite fie...
متن کاملMoving Algebraic Cycles of Bounded Degree
The Chow Moving Lemma is a theorem which asserts that a given algebraic s-cycle on a smooth algebraic variety X can be moved within its rational equivalence class to intersect properly a given r-cycle on X provided that r + s ≥ dim(X) (cf. [Chow], [S2]). In the past few years, there has been considerable interest in studying spaces of algebraic cycles rather than simply cycles modulo an equival...
متن کاملOn the Number of Hamilton Cycles in Bounded Degree Graphs
The main contribution of this paper is a new approach for enumerating Hamilton cycles in bounded degree graphs – deriving thereby extremal bounds. We describe an algorithm which enumerates all Hamilton cycles of a given 3-regular n-vertex graph in time O(1.276), improving on Eppstein’s previous bound. The resulting new upper bound of O(1.276) for the maximum number of Hamilton cycles in 3-regul...
متن کاملThe Ramsey number of a graph with bounded maximum degree
The Ramsey number of a graph G is the least number t for which it is true that whenever the edges of the complete graph on t vertices are colored in an arbitrary fashion using two colors, say red and blue, then it is always the case that either the red subgraph contains G or the blue subgraph contains G. A conjecture of P. Erdos and S. Burr is settled in the afftrmative by proving that for each...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kyoto Journal of Mathematics
سال: 2004
ISSN: 2156-2261
DOI: 10.1215/kjm/1250281701